Anti-clipping method for image sharpness enhancement

ABSTRACT

An image processing system provides image enhancement and anti-clipping units. The anti-clipping unit for image sharpness enhancement, operates such that any shoot artifacts in the enhanced image that go beyond pixel value lower/upper bounds are properly adjusted back within the lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

FIELD OF THE INVENTION

The present invention relates to digital image processing, and more particularly to the method of anti-clipping for image sharpness enhancement.

BACKGROUND OF THE INVENTION

In digital image processing, each pixel value in a digital image is represented by a set of finite integer numbers and bounded by two integer numbers called the “lower bound” and “upper bound”. The pixel value represents the grayscale level or the brightness of a pixel which is bounded within the lower bound and upper bound. The lower bound usually is chosen to be 0 (black color in grayscale level) and the corresponding upper bound equals 2^(n)−1 (white color in grayscale level), where n is the number of bits (binary numbers) used for representing the grayscale level (e.g., in 8-bit grayscale image, lower bound=0 and upper bound=2⁸−1=256−1=255). For example, in an 8-bit grayscale digital image, each pixel value belongs to the set of 256 integer numbers {0, 1, . . . , 255}, wherein the lower and upper bounds are 0 and 255, respectively.

Typically, when image sharpness enhancement is applied to a digital input image, the resulting output image contains many shoot artifacts (e.g., overshoots, undershoots, etc.) around sharp transition areas such as strong edges in the input image. Those shoot artifacts can either remain within, or go beyond, the lower and upper bounds of the pixels in the image. Conventionally, the shoot artifacts that go beyond said lower and upper bounds, are clipped according to the lower bound L and upper bound U. Specifically, the shoot artifacts are set to L if they are less than L, and set to U if greater than U. However, by extensive experiment and testing, it has been observed that the conventional clipping method results in the jaggedness artifact along the strong edges and lines in the image.

BRIEF SUMMARY OF THE INVENTION

An object of the present invention is to improve on, and generalize, the conventional clipping method so that shoot artifacts in an enhanced image are properly adjusted back within pixel value lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

In one embodiment the present invention provides an image processing system implementing an anti-clipping method for image sharpness enhancement. The anti-clipping method improves on and generalizes the conventional clipping method in such a way that shoot artifacts in the processed image that go beyond the pixel value lower/upper bounds are properly adjusted back within the lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

In one embodiment the present invention provides and anti-clipping method and system for image sharpness enhancement. The steps of performing anti-clipping includes the steps of detecting signal values in the enhanced signals which are below a lower bound or are above an upper bound, and adjusting the detected signal values to be within the selected upper and lower bound, without introducing prominent unwanted artifacts in the output signal.

The steps of performing anti-clipping for a current enhanced signal value further includes the steps of generating an alpha coefficient as a function of the current enhanced signal value, the corresponding digital signal value, a lower bound and an upper bound, wherein the alpha coefficient represents the amount of adjustment for the current enhanced signal value. Each enhanced signal value has an associated alpha coefficient. The steps of performing anti-clipping for a current enhanced signal value further includes the steps of: filtering the alpha coefficient to generate a refined coefficient for the current enhanced signal value; subtracting the digital signal from the enhanced signal to generate a first signal; multiplying the refined coefficient to the first signal to generate a second signal; and adding the second signal to the digital signal to generate said output signal.

The present invention further provides an image processing system that implements the method of the present invention.

As such, in one aspect, the present invention provides an anti-clipping method and system for image sharpness enhancement, wherein any shoot artifacts in the processed (i.e., enhanced) image that go beyond pixel value lower/upper bounds are properly adjusted back within the lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

Other features and advantages of the present invention will be apparent from the following specifications taken in conjunction with the following drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a block diagram illustrating the application of image sharpness enhancement to an input image followed by a conventional clipping unit.

FIG. 2 shows a block diagram of an embodiment of an image processing system that performs an image sharpness enhancement process on the input image followed by an anti-clipping process, according to an embodiment of the present invention.

FIG. 3 shows an example graphical method of calculating the alpha coefficient in the alpha calculator of FIG. 2, according to an embodiment of the present invention.

FIGS. 4(a)-(e) illustrate examples of window shapes which can be used in the filtering unit of FIG. 2.

DETAILED DESCRIPTION OF THE INVENTION

In one embodiment the present invention provides an image processing system implementing an anti-clipping method for image sharpness enhancement. The anti-clipping method improves on and generalizes the conventional clipping method in such a way that shoot artifacts in the processed image that go beyond the pixel value lower/upper bounds are properly adjusted back within the lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

FIG. 1 illustrates a conventional system 100 implementing the application of an image sharpness enhancement unit 102 to the input image f to generate the processed image f_(p), followed by a clipping unit 104 based on the preset upper U and lower bounds L to generate the output imager f_(out). The clipping unit 104 may be a conventional clipping unit as known to those skilled in the art, used in this example.

Those skilled in the art will recognize, the sharpness enhancement unit 102 can implement any image sharpness enhancement algorithm that can boost up the energy in the high frequency component of the image, while leaving the low frequency components unchanged. An example of image sharpness enhancement algorithm is to apply the “high-boost spatial filter” represented by relation (1) below to the input image f: $\begin{matrix} {h = {\frac{1}{9}\begin{bmatrix} {- 1} & {- 1} & {- 1} \\ {- 1} & 17 & {- 1} \\ {- 1} & {- 1} & {- 1} \end{bmatrix}}} & (1) \end{matrix}$

Without loss of generality, the present invention assumes that the input image f and processed image f_(p) are available for conventional clipping, and as such the sharpness enhancement unit 102 is not discussed further.

The function of the clipping unit 104 is now described. Let M and N denote the numbers of rows and columns of both input and processed images f and f_(p), respectively. For the sake of brevity, the indices x and y are omitted in the FIG. 1. The current processed pixel value f_(p)[x, y] at the row y and column x is clipped according to relation (2) below, wherein for y=0, 1, 2, . . . , M and x=0, 1, 2, . . . , N, the clipped result f_(out)[x, y] can be expressed by: $\begin{matrix} {{f_{out}\left\lbrack {x,y} \right\rbrack} = \left\{ \begin{matrix} L & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} < L};} \\ U & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} > U};} \\ {f\left\lbrack {x,y} \right\rbrack} & {{otherwise}.} \end{matrix} \right.} & (2) \end{matrix}$

As noted, the lower bound L and the upper bound U are usually determined from the number of bits used in representing digital image. For an arbitrary n-bit digital image, the typical choices of L and U are 0 and 2^(n)−1, respectively.

FIG. 2 illustrates a system 200 according to an embodiment of the present invention, implementing the application of an image sharpness enhancement unit 202 to the input image f to generate the processed image f_(p), followed by an anti-clipping unit 204 based on the preset upper U and lower bounds L to generate the output image f_(out). The anti-clipping unit 204 includes two main modules: an alpha calculator 206 and a filtering unit 208.

The alpha calculator 206 is used to calculate an alpha coefficient α[x, y] from each pixel of input f[x, y] and processed f_(p)[x, y] images. Each enhanced signal value has an associated alpha coefficient. The alpha coefficient α[x,y] indicates the degree of adjustment to the current input pixel value, as described further below in relation to FIG. 3. The alpha coefficients are then filtered in the filtering unit 208 using a selected window of pixels around the current pixel.

For the filtering unit 208, one of the example window shapes in FIGS. 4(a)-(e) can be used in filtering. Each window 400 in the image shown in FIG. 4, includes at least the current pixel 402, and in FIGS. 4(b)-(e) surrounding pixels 404. Two filter operators e.g. {MIN, AVG} can be used in the filtering unit 208, wherein the MIN and AVG operators are, respectively, the minimum and average operators. In this example, choice between these two filters depends on the user input. The MIN operator is nonlinear while AVG is a linear operator.

An example filtering operation is now described. Using the window shape in FIG. 4(c) the refined coefficients β[x, y] based on the MIN operator are calculated by choosing the minimum value among the alpha coefficient α[x, y] for the current pixel 402 (indicated by the symbol x in FIG. 4(c)), and the alpha coefficients of its immediate four neighboring pixels 404 (i.e., alpha coefficients on the left α[x−1, y], on the right α[x+1, y], on the top α[x, y−1], and at the bottom α[x, y+1]), according to window shape, wherein: β[x,y]=min(α[x,y],α[x−1,y],α[x+1,y],α[x,y−1],α[x,y+1])  (3)

Selecting the window shape in FIG. 4(c) is only an example. Other window shapes can also be selected. Further, the MIN operator is an example filter operator used herein.

With the same example, the refined coefficient β[x, y] based on the AVG operator can be obtained as: $\begin{matrix} {{\beta\left\lbrack {x,y} \right\rbrack} = {\frac{1}{5}\begin{pmatrix} {{\alpha\left\lbrack {x,y} \right\rbrack} + {\alpha\left\lbrack {{x - 1},y} \right\rbrack} + {\alpha\left\lbrack {{x + 1},y} \right\rbrack} +} \\ {{\alpha\left\lbrack {x,{y - 1}} \right\rbrack} + {\alpha\left\lbrack {x,{y + 1}} \right\rbrack}} \end{pmatrix}}} & (4) \end{matrix}$

According to the above example, the refined coefficient β[x, y] based on other selection of window shapes in FIGS. 4(a)-(e) can be calculated in the same fashion as those skilled in the art will recognize. Once a refined coefficient β[x, y] is calculated, it is multiplied with the difference f_(p)[x, y]−f[x, y], and the result is added back to the original input pixel value f[x, y] to obtain the final output pixel value f_(out)[x, y], as: f _(out) [x,y]=f[x,y]+β[x,y]·(f _(p) [x,y]−f[x,y])  (5)

The anti-clipping method is repeated until the last pixel of both the input image f and the enhanced image f_(p) are processed. It is noted that if the refined coefficient β[x, y] equals one, the final output pixel value f_(out)[x, y] will equal the processed pixel value f_(p)[x, y].

FIG. 3 illustrates a graphical example of calculating the alpha coefficient by the alpha calculator 206. In FIG. 3, x and y denote the current pixel location in the image f, (i.e., y is the row number and x is the column number in the row y). In FIG. 3, the processed pixel and its corresponding input pixel are denoted by the filled circle (•) and hallow circle (°), respectively. The alpha coefficient α[x,y] associated with the current pixel value f[x, y] is calculated according to relation (6) below showing three conditions: $\begin{matrix} {{\alpha\left\lbrack {x,y} \right\rbrack} = \left\{ \begin{matrix} \frac{U - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} > U};}\quad} \\ \frac{L - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} < L};} \\ 1 & {{otherwise}.} \end{matrix} \right.} & (6) \end{matrix}$

Accordingly, the alpha coefficient equals one if and only if the corresponding processed pixel value is within the close interval from L to U indicated by the area 302 in the FIG. 3; otherwise, the alpha coefficient is calculated according to the first two conditions in relation (6) above. It is worth noting that the alpha coefficient is bounded by 0 and 1 —i.e., 0≦α≦1. The first two conditions in relation (6) mean that the processed pixel fp [x, y] is either greater than the upper bound U (first condition) or less than the lower bound L (second condition).

In FIG. 3, four examples of calculating alpha coefficients are provided. As in this example the current processed pixel value f_(p)[x, y] is greater than the upper bound U, the first (topmost) condition in relation (6) is satisfied, wherein the alpha coefficient α[x, y] is obtained by calculating A/B, where A=U−f[x, y] and B=f_(p)[x, y]−f[x, y]. The other three alpha coefficients corresponding to the rest of pixels are equal to one because their processed pixel values are within the area 302 or the closed interval from L to U. The area 302 indicates the closed interval from L to U. Whenever the processed pixel falls within this area, the alpha coefficient is set to 1 according to relation (6).

As noted, FIGS. 4(a)-(e) show an example set of five different window shapes 400 that can be used in the filtering unit 208 in FIG. 2. The significant difference between the windows 400 in FIGS. 4(a)-(e) is related to their shapes as well as the number of neighbors surrounding the considered alpha coefficient. In FIGS. 4(a)-(e) the symbol x indicates the center of the window 400 and it is always associated with the alpha coefficient α[x, y] of the current pixel 402. By selecting the window shape in FIG. 4(a) and either MIN or AVG filter operator in the filtering unit 208, it is straightforward to verify that the resulting output is equivalent to the conventional clipping counterpart. The conventional clipping is only a special case of an embodiment of an anti-clipping according to the present invention when the window in 4(a) is selected. When the window in FIG. 4(a) is selected, the final resulting output is that of the conventional clipping method. This is useful in practice because as a result the anti-clipping method of the present invention can perform in different modes (depending on chosen window shapes and filter operators) wherein the conventional clipping result can be obtained simply by selecting a proper window shape (window in FIG. 4(a)).

As such, an anti-clipping method according to the present invention provides more flexibility in choosing other window shapes 400 such as in FIGS. 4(b)-(e) and filter operators {MIN, AVG} in order to make the final output bounded by the closed interval [L, U], while not causing the obvious edge jaggedness artifacts. In addition to the example window shapes 400 in FIGS. 4(a)-(e) other window shapes are also possible.

The example window shapes shown in FIGS. 4(a)-(e) are used in the filtering module 208. Different window shapes provide different setting of neighbors of considered alpha coefficient. The basic criterion of selecting window shapes is now described. The window shape in FIG. 4(a) is used when the conventional clipping result is needed. If the input signal is one-dimensional signal, such as audio signal, then the window shape in FIG. 4(b) can be used. However, this window has only two neighbors (on left and right of considered alpha coefficient). Other variations such as four or more neighbors can also be applied. If the input signal is two-dimensional signal, such as digital image, then window shapes in FIGS. 4(b)-(e) can be used. In one example simulation of anti-clipping for digital image sharpness enhancement, the inventors used the window shape in FIG. 4(c) as the default window shape.

An example anti-clipping method implementation for an input image f having a width N and height M (i.e., N×M pixels), according to an embodiment of the present invention, includes the steps of:

(a) for y=0, 1, . . . , N and x=0, 1, 2, . . . , M, based on the input image f[x, y], processed image f_(p)[x, y] and the preset lower bound L and upper bound U, calculate an alpha coefficient α[x, y] (usually the processing is performed for each row and then each column in the current row);

(b) based on the chosen window shape from the example window shape collection in FIGS. 4(a)-(e), and a chosen filter operator (MIN or AVG), perform filtering of the alpha coefficients to obtain a refined coefficient β[x, y];

(c) subtract the input pixel value from the processed pixel value f_(p)to obtain the difference pixel value f_(p)[x, y]−f[x, y];

(d) multiply the refined coefficient β[x, y] with the difference pixel value f_(p)[x, y]−f[x, y];

(e) add the result of step (d) back to the original input pixel value to obtain final output pixel value f_(out)[x, y]; and

(f) repeat steps (a) to (e) till the last pixel of the processed image.

As such, in one aspect, the present invention provides an anti-clipping method and system for image sharpness enhancement, wherein any shoot artifacts in the processed (i.e., enhanced) image that go beyond pixel value lower/upper bounds are properly adjusted back within the lower and upper bounds, without causing prominent edge jaggedness artifacts in the final resulting output image.

As those skilled in the art will recognize, an anti-clipping method according to the present invention is not only useful in digital image (two-dimensional) processing, but is also applicable to one-dimensional digital signal processing such as digital audio signals when proper window shapes are used. The window shapes which are applicable to one-dimensional digital signals are, for example, window shapes in FIGS. 4(a)-(b).

The present invention has been described in considerable detail with reference to certain preferred versions thereof; however, other versions are possible. For example, other window shapes are not limited to those shown in FIGS. 4(a)-(e), and other window shape variations can be utilized. Therefore, the spirit and scope of the appended claims should not be limited to the description of the preferred versions contained herein. 

1. A signal processing method for enhancing a digital signal, comprising the steps of: enhancing the digital signal to generate an enhanced signal; and performing anti-clipping on the enhanced signal to generate an output signal, whereby one or more enhanced signal values in the enhanced signal are adjusted to be within selected lower and upper bounds, without introducing prominent unwanted artifacts in the output signal.
 2. The method of claim 1 wherein the steps of performing anti-clipping further includes the steps of: detecting signal values in the enhanced signals which are below a lower bound or are above an upper bound; and adjusting the detected signal values to be within the selected upper and lower bound, without introducing prominent unwanted artifacts in the output signal.
 3. The method of claim 1 wherein the steps of performing anti-clipping for a current enhanced signal value further includes the steps of: generating an alpha coefficient as a function of the current enhanced signal value, the corresponding digital signal value, a lower bound and an upper bound, wherein the alpha coefficient represents the amount of adjustment for the current enhanced signal value.
 4. The method of claim 3 wherein the steps of performing anti-clipping for a current enhanced signal value further includes the steps of: filtering the alpha coefficient to generate a refined coefficient for the current enhanced signal value; subtracting the digital signal from the enhanced signal to generate a first signal; multiplying the refined coefficient to the first signal to generate a second signal; and adding the second signal to the digital signal to generate said output signal.
 5. The method of claim 3 wherein the steps of performing anti-clipping for a current enhanced signal value further includes the steps of: generating an alpha coefficient for one or more enhanced signal values proximate the current enhanced signal value, wherein each enhanced signal value has an associated alpha coefficient; and applying filtering to the alpha coefficient of the current enhanced signal value and the alpha coefficients of signals values of said proximate signal values, to generate a refined coefficient for the current enhanced signal value.
 6. The method of claim 5 wherein the step of filtering further includes the steps of applying an averaging filter to the alpha coefficients of the current enhanced signal value and the alpha coefficients proximate signal values, to generate a refined coefficient for the current enhanced signal value.
 7. The method of claim 5 wherein the step of filtering further includes the steps of applying a minimum filter to the alpha coefficients of the current enhanced signal value and the alpha coefficients proximate signal values, to generate a refined coefficient for the current enhanced signal value.
 8. The method of claim 5 wherein the steps of performing anti-clipping for the current enhanced signal value further includes the steps of: subtracting said corresponding digital signal value from said enhanced signal value to generate a first signal; multiplying the refined coefficient to the first signal to generate a second signal; and adding the second signal to the digital signal to generate said output signal associated with said corresponding digital signal value.
 9. The method of claim 3 wherein the digital signal represents a digital input image comprising multiple pixels, and the enhanced digital signal represents an enhanced image comprising multiple pixels corresponding to the pixels in the digital input image.
 10. The method of claim 9 wherein the steps of generating the alpha coefficient α[x, y] for a current processed pixel includes the steps of determining: ${\alpha\left\lbrack {x,y} \right\rbrack} = \left\{ \begin{matrix} \frac{U - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} > U};}\quad} \\ \frac{L - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} < L};} \\ 1 & {{otherwise},} \end{matrix} \right.$ wherein f represents the input image, f_(p) represents the enhanced image, x and y denote the current pixel location in the input image f where y is the row number and x is the column number in the row y, such that alpha coefficient α[x,y] is associated with the current pixel value f[x, y] and the current enhanced pixel value f_(p)[x, y], U represents a pixel value upper bound, and L represents a pixel value lower bound.
 11. A signal processing system for enhancing a digital signal, comprising: a signal enhancer that enhances the digital signal to generate an enhanced signal; and an anti-clipper that performs anti-clipping on the enhanced signal to generate an output signal, whereby one or more enhanced signal values in the enhanced signal are adjusted to be within selected lower and upper bounds, without introducing prominent unwanted artifacts in the output signal.
 12. The system of claim 11 wherein the anti-clipper further detects signal values in the enhanced signals which are below a lower bound or are above an upper bound, and adjusts the detected signal values to be within the selected upper and lower bound, without introducing prominent unwanted artifacts in the output signal.
 13. The system of claim 11 wherein the anti-clipper comprises an adjustment coefficient calculator that generates an alpha coefficient for a current signal value as a function of the current enhanced signal value, the corresponding digital signal value, a lower bound and an upper bound, wherein the alpha coefficient represents the amount of adjustment for the current enhanced signal value.
 14. The system of claim 13 wherein the anti-clipper further includes: a filter that filters the alpha coefficient to generate a refined coefficient for the current enhanced signal value; a subtractor that subtracts the digital signal from the enhanced signal to generate a first signal; a multiplier that applies the refined coefficient to the first signal to generate a second signal; and an adder that adds the second signal to the digital signal to generate said output signal.
 15. The system of claim 13 wherein the adjustment coefficient calculator further generates an alpha coefficient for one or more enhanced signal values proximate the current enhanced signal value, and the filter filters the alpha coefficient of the current enhanced signal value and the alpha coefficients of signals values of said proximate signal values, to generate a refined coefficient for the current enhanced signal value.
 16. The system of claim 15 wherein the filter comprises an averaging filter.
 17. The system of claim 15 wherein the filter comprises minimum filter.
 18. The system of claim 15 wherein the anti-clipper further includes: a subtractor for subtracting said corresponding digital signal value from said enhanced signal value to generate a first signal; a first combiner for multiplying the refined coefficient to the first signal to generate a second signal; and a second combiner for combining the second signal with the digital signal to generate said output signal associated with said corresponding digital signal value.
 19. The system of claim 13 wherein the digital signal represents a digital input image comprising multiple pixels, and the enhanced digital signal represents an enhanced image comprising multiple pixels corresponding to the pixels in the digital input image.
 20. The system of claim 19 wherein adjustment coefficient calculator generates the alpha coefficient α[x,y] for a current processed pixel by determining: ${\alpha\left\lbrack {x,y} \right\rbrack} = \left\{ \begin{matrix} \frac{U - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} > U};}\quad} \\ \frac{L - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} < L};} \\ 1 & {{otherwise},} \end{matrix} \right.$ wherein f represents the input image, f_(p) represents the enhanced image, x and y denote the current pixel location in the input image f, where y is the row number and x is the column number in the row y, such that alpha coefficient α[x,y] is associated with the current pixel value f[x, y] and the current enhanced pixel value f_(p)[x, y], U represents a pixel value upper bound, and L represents a pixel value lower bound.
 21. An image processor for processing an enhanced digital signal corresponding to an input digital signal, comprising: an anti-clipper that performs anti-clipping on the enhanced signal to generate an output signal, whereby one or more enhanced signal values in the enhanced signal are adjusted to be within selected lower and upper bounds, without introducing prominent unwanted artifacts in the output signal.
 22. The image processor of claim 21 wherein the anti-clipper further detects signal values in the enhanced signals which are below a lower bound or are above an upper bound, and adjusts the detected signal values to be within the selected upper and lower bound, without introducing prominent unwanted artifacts in the output signal.
 23. The image processor of claim 21 wherein the anti-clipper comprises an adjustment coefficient calculator that generates an alpha coefficient for a current signal value as a function of the current enhanced signal value, the corresponding digital signal value, a lower bound and an upper bound, wherein the alpha coefficient represents the amount of adjustment for the current enhanced signal value.
 24. The image processor of claim 23 wherein the anti-clipper further includes: a filter that filters the alpha coefficient to generate a refined coefficient for the current enhanced signal value; a subtractor that subtracts the digital signal from the enhanced signal to generate a first signal; a multiplier that applies the refined coefficient to the first signal to generate a second signal; and an adder that adds the second signal to the digital signal to generate said output signal.
 25. The image processor of claim 23 wherein the adjustment coefficient calculator further generates an alpha coefficient for one or more enhanced signal values proximate the current enhanced signal value, and the filter filters the alpha coefficient of the current enhanced signal value and the alpha coefficients of signals values of said proximate signal values, to generate a refined coefficient for the current enhanced signal value.
 26. The image processor of claim 25 wherein the filter comprises an averaging filter.
 27. The image processor of claim 25 wherein the filter comprises minimum filter.
 28. The image processor of claim 25 wherein the anti-clipper further includes: a subtractor for subtracting said corresponding digital signal value from said enhanced signal value to generate a first signal; a first combiner for applying the refined coefficient to the first signal to generate a second signal; and a second combiner for combining the second signal with the digital signal to generate said output signal associated with said corresponding digital signal value.
 29. The image processor of claim 23 wherein the digital signal represents a digital input image comprising multiple pixels, and the enhanced digital signal represents an enhanced image comprising multiple pixels corresponding to the pixels in the digital input image.
 30. The image processor of claim 29 wherein adjustment coefficient calculator generates the alpha coefficient α[x,y] for a current processed pixel by determining: ${\alpha\left\lbrack {x,y} \right\rbrack} = \left\{ \begin{matrix} \frac{U - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} > U};}\quad} \\ \frac{L - {f\left\lbrack {x,y} \right\rbrack}}{{f_{p}\left\lbrack {x,y} \right\rbrack} - {f\left\lbrack {x,y} \right\rbrack}} & {{{{if}\quad{f_{p}\left\lbrack {x,y} \right\rbrack}} < L};} \\ 1 & {{otherwise},} \end{matrix} \right.$ wherein f represents the input image, f_(p) represents the enhanced image, x and y denote the current pixel location in the input image f where y is the row number and x is the column number in the row y, such that alpha coefficient α[x,y] is associated with the current pixel value f[x, y] and the current enhanced pixel value f_(p)[x, y], U represents a pixel value upper bound, and L represents a pixel value lower bound. 